Sorting quantum systems efficiently
نویسنده
چکیده
Measuring the state of a quantum system is a fundamental process in quantum mechanics and plays an essential role in quantum information and quantum technologies. One method to measure a quantum observable is to sort the system in different spatial modes according to the measured value, followed by single-particle detectors on each mode. Examples of quantum sorters are polarizing beam-splitters (PBS) - which direct photons according to their polarization - and Stern-Gerlach devices. Here we propose a general scheme to sort a quantum system according to the value of any d-dimensional degree of freedom, such as spin, orbital angular momentum (OAM), wavelength etc. Our scheme is universal, works at the single-particle level and has a theoretical efficiency of 100%. As an application we design an efficient OAM sorter consisting of a single multi-path interferometer which is suitable for a photonic chip implementation.
منابع مشابه
Fluorescent Contrast agent Based on Graphene Quantum Dots Decorated Mesoporous Silica Nanoparticles for Detecting and Sorting Cancer Cells
Background and Objectives: The inability of classic fluorescence-activated cell sorting to single cancer cell sorting is one of the most significant drawbacks of this method. The sorting of cancer cells in microdroplets significantly influences our ability to analyze cancer cell proteins. Material and Methods: We adapted a developed microfluidic device as a 3D in vitro model to sorted MCF-7 c...
متن کاملTemporal mode sorting using dual-stage quantum frequency conversion by asymmetric Bragg scattering.
The temporal shape of single photons provides a high-dimensional basis of temporal modes, and can therefore support quantum computing schemes that go beyond the qubit. However, the lack of linear optical components to act as quantum gates has made it challenging to efficiently address specific temporal-mode components from an arbitrary superposition. Recent progress towards realizing such a "qu...
متن کاملAn Efficient Parallel Sorting Algorithm on Metacube Multiprocessors
Parallel sorting algorithms in hypercubes have been studied extensively. One of the practical parallel sorting algorithms is Bitonic Sort, which is implemented in O(n) time for sorting N = 2 numbers in an n-cube. A versatile family of interconnection networks alternative to hypercube, called metacube, was proposed for building extremely large scale multiprocessor systems with a small number of ...
متن کاملTime-constrained sorting-a comparison of different algorithms
The designers of real-time systems try to avoid a poor utilization of hardware by assigning only the absolutely necessary time budget to each task. In certain cases it is also acceptable to cut the time quantum assigned to a task below its worst-case needs, provided (a) a high percentage of executions complete within this quantum and (b) the quality of the aborted computations is su cient for f...
متن کاملThe effects of suspending medium on dielectrophoretic systems for separating and sorting carbon nanotubes
The separation of two different types of multi-walled carbon nanotubes is studied in a dielectrophoresis-based microchannel system in seven different solvents as the suspending medium. A simple model was developed to predict the behavior of the multi-walled carbon nanotubes in the above mentioned system. Then, the equations of motion for the multi-walled carbon nanotubes in that system were in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 6 شماره
صفحات -
تاریخ انتشار 2016